Перевод: с испанского на все языки

со всех языков на испанский

an easily solved problem

См. также в других словарях:

  • Problem of induction — The problem of induction is the philosophical question of whether inductive reasoning is valid. That is, what is the justification for either:# generalizing about the properties of a class of objects based on some number of observations of… …   Wikipedia

  • Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… …   Wikipedia

  • Solved game — A two player game can be solved on several levels: [V. Allis, Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of ComputerScience, University of Limburg, 1994. Online:… …   Wikipedia

  • Problem of evil — Part of a series on God General conceptions …   Wikipedia

  • Dynamic problem (algorithms) — Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem in this category is usually stated as follows: Given a class of input objects, find efficient… …   Wikipedia

  • Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

  • Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 …   Wikipedia

  • Special cases of Apollonius' problem — In Euclidean geometry, Apollonius problem is to construct all the circles that are tangent to three given circles. Limiting cases of Apollonius problem are those in which at least one of the given circles is a point or line, i.e., is a circle of… …   Wikipedia

  • Closest pair of points problem — Closest pair of points shown in red The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair of points with the smallest distance between them. Its two… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»